Evolutionary Multiobjective Optimization for the Pickup and Delivery Problem with Time Windows and Demands

نویسندگان

  • Dung H. Phan
  • Junichi Suzuki
چکیده

This paper studies an evolutionary algorithm to solve a new multiobjective optimization problem, the Pickup and Delivery Problem with Time Windows and Demands (PDPTW-D), which extends PDP and PDP-TW. With respect to multiple optimization objectives, PDP-TW-D is to find a set of Pareto-optimal routes for a fleet of vehicles in order to serve given transportation requests. The proposed algorithm uses a population of individuals, each of which represents a solution candidate, and evolves them through generations to seek the Pareto-optimal solutions with respect to given multiple objectives. In addition to evolution, the proposed algorithm allows individuals to learn and improve themselves in each generation with a local search algorithm. Experimental results demonstrate that the evolutionary and learning processes complement with each other in the proposed algorithm and can effectively obtain quality solutions to PDP-TW-D.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

R2 Indicator based Multiobjective Memetic Optimization for the Pickup and Delivery Problem with Time Windows and Demands (PDP-TW-D)

This paper defines a multiobjective variant of the Pickup and Delivery Problem (PDP), called PDP with Time Windows and Demands (PDP-TW-D), and approaches the problem with a novel memetic optimization algorithm. With respect to multiple optimization objectives, the goal of PDP-TW-D is to find a set of Pareto-optimal routes for a fleet of vehicles in order to serve given transportation requests. ...

متن کامل

An Improved Particle Swarm Optimization for a Class of Capacitated Vehicle Routing Problems

Vehicle Routing Problem (VRP) is addressed to a class of problems for determining a set of vehicle routes, in which each vehicle departs from a given depot, serves a given set of customers, and returns back to the same depot. On the other hand, simultaneous delivery and pickup problems have drawn much attention in the past few years due to its high usage in real world cases. This study, therefo...

متن کامل

The fuzzy multi-depot vehicle routing problem with simultaneous pickup and delivery: Formulation and a heuristic algorithm

In this paper, the fuzzy multi-depot vehicle routing problem with simultaneous pickup and delivery (FMDVRP-SPD) is investigated. The FMDVRP-SPD is the problem of allocating customers to several depots, so that the optimal set of routes is determined simultaneously to serve the pickup and the delivery demands of each customer within scattered depots. In the problem, both pickup and delivery dema...

متن کامل

The Bi-Objective Location-Routing Problem based on Simultaneous Pickup and Delivery with Soft Time Window

The location-routing problem is the most significant and yet new research field in location problems that considers simultaneously vehicle routing problem features with original one for achieving high-quality integrated distribution systems in beside of the global optimum. Simultaneous pickup and delivery based on time windows are the two main characteristics of logistic management that have be...

متن کامل

A Hybrid Algorithm for a Two-Echelon Location- Routing Problem with Simultaneous Pickup and Delivery under Fuzzy Demand

Location-Routing Problem (LRP) emerges as one of the hybrid optimization problems in distribution networks in which, total cost of the system would be reduced significantly by simultaneous optimization of locating a set of facilities among candidate locations and routing vehicles. In this paper, a mixed integer linear programming model is presented for a two-echelon location-routing problem wit...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • MONET

دوره 21  شماره 

صفحات  -

تاریخ انتشار 2016